What Does the Evolution Path Learn in CMA-ES?

نویسندگان

  • Zhenhua Li
  • Qingfu Zhang
چکیده

The Covariance matrix adaptation evolution strategy (CMA-ES) evolves a multivariate Gaussian distribution for continuous optimization. The evolution path, which accumulates historical search direction in successive generations, plays a crucial role in the adaptation of covariance matrix. In this paper, we investigate what the evolution path approximates in the optimization procedure. We show that the evolution path accumulates natural gradient with respect to the distribution mean, and works as a momentum under stationary condition. The experimental results suggest that it approximates a scale direction expanded by singular values along corresponding eigenvectors of the inverse Hessian. Further, we show that the outer product of evolution path serves as a rank-1 momentum term for the covariance matrix. This paper will be presented at The 14th International Conference on Parallel Problem Solving from Nature (PPSN XIV), which will be organized by Edinburgh Napier University, Edinburgh, Scotland, UK on September 17-21st, 2016. Supervisor: Prof Qingfu Zhang Research Interests: Evolutionary Computation and Machine Learning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Task Scheduling Algorithm Using Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in Cloud Computing

The cloud computing is considered as a computational model which provides the uses requests with resources upon any demand and needs.The need for planning the scheduling of the user's jobs has emerged as an important challenge in the field of cloud computing. It is mainly due to several reasons, including ever-increasing advancements of information technology and an increase of applications and...

متن کامل

Qualms Regarding the Optimality of Cumulative Path Length Control in CSA/CMA-Evolution Strategies

Cumulative step-size adaptation (CSA) based on path length control is regarded as a robust alternative to the standard mutative self-adaptation technique in evolution strategies (ES), guaranteeing an almost optimal control of the mutation operator. This paper shows that the underlying basic assumption in CSA--the perpendicularity of expected consecutive steps--does not necessarily guarantee opt...

متن کامل

THE CMA EVOLUTION STRATEGY BASED SIZE OPTIMIZATION OF TRUSS STRUCTURES

Evolution Strategies (ES) are a class of Evolutionary Algorithms based on Gaussian mutation and deterministic selection. Gaussian mutation captures pair-wise dependencies between the variables through a covariance matrix. Covariance Matrix Adaptation (CMA) is a method to update this covariance matrix. In this paper, the CMA-ES, which has found many applications in solving continuous optimizatio...

متن کامل

On Low Complexity Acceleration Techniques for Randomized Optimization

Recently it was shown by Nesterov (2011) that techniques form convex optimization can be used to successfully accelerate simple derivativefree randomized optimization methods. The appeal of those schemes lies in their low complexity, which is only Θ(n) per iteration—compared to Θ(n) for algorithms storing second-order information or covariance matrices. From a high-level point of view, those ac...

متن کامل

The CMA Evolution Strategy: A Tutorial

3 Adapting the Covariance Matrix 10 3.1 Estimating the Covariance Matrix From Scratch . . . . . . . . . . . . . . . . 10 3.2 Rank-μ-Update . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.3 Rank-One-Update . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.3.1 A Different Viewpoint . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.3.2 Cumulation: Uti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016